Dynamic programming in countercurrent systems
نویسندگان
چکیده
منابع مشابه
Natural Heuristic Dynamic Programming for Dynamic Systems
Heuristic Dynamic Programming (HDP) is the simplest kind of Adaptive Critic 1]. It can be used to maximize or minimize any utility function, such as total energy or trajectory error, of a system over time in a noisy environment. In this article, we propose a new version of HDP, called NHDP (Natural Heuristic Dynamic Programming). This new version incorporates basic HDP algorithm with the follow...
متن کاملOn Relaxed Dynamic Programming in Switching Systems
In order to simplify computational methods based on dynamic programming, a relaxed procedure based on upper and lower bounds of the optimal cost was recently introduced. The convergence properties of this procedure are analyzed in this paper. In particular, it is shown that the computational effort in finding an approximately optimal control law by relaxed value iteration is related to the poly...
متن کاملModelling and Decision-making on Deteriorating Production Systems using Stochastic Dynamic Programming Approach
This study aimed at presenting a method for formulating optimal production, repair and replacement policies. The system was based on the production rate of defective parts and machine repairs and then was set up to optimize maintenance activities and related costs. The machine is either repaired or replaced. The machine is changed completely in the replacement process, but the productio...
متن کاملConvex dynamic programming for hybrid systems
A classical linear programming approach to optimization of flow or transportation in a discrete graph is extended to hybrid systems. The problem is finite dimensional if the state space is discrete and finite, but becomes infinite dimensional for a continuous or hybrid state space. It is shown how strict lower bounds on the optimal loss function can be computed by gridding the continuous state ...
متن کاملParametric Dynamic Programming for Discrete Event Systems
This paper describes an approach based on formal calculus to optimize trajectories described by a succession of discrete states, by means of combining the Dynamic Programming technique with the formal approach presented in [Cardillo et 2001]. This approach allows to obtain an explicit form of the optimal control sequence, based on formal calculus. It also allows to introduce parameters in the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1963
ISSN: 0022-247X
DOI: 10.1016/0022-247x(63)90062-3